Fast genetic algorithm for roundness evaluation by the minimum zone tolerance (MZT) method
نویسنده
چکیده
The main goal of the minimum zone tolerance (MZT) method is to achieve the best estimation of the roundness error, but it is computationally intensive. This paper describes the application of a genetic algorithm (GA) to minimize the computation time in the evaluation of CMM roundness errors of a large cloud of sampled datapoints (0.2° equally spaced datapoints). Computational experiments have shown that by selecting the optimal GA parameters, namely a combination of the four genetic parameters related to population size, crossover, mutation, and stop conditions, the computation time can be reduced by up to one order of magnitude, allowing realtime operation. Optimization has been tested using seven CMM datasets, obtained from different machining features, and compared with the LSQ method. The performance of the optimized algorithm has been validated with GA from the literature using four benchmark datasets.
منابع مشابه
Optimum Dataset Size and Search Space for Minimum Zone Roundness Evaluation by Genetic Algorithm
Roundness is one of the most common features in machining. The minimum zone tolerance (MZT) approach provides the minimum roundness error, i.e. the minimum distance between the two concentric reference circles containing the acquired profile; more accurate form error estimation results in less false part rejections. MZT is still an open problem and is approached here by a Genetic Algorithm. Onl...
متن کاملAn Evolutionary Method for Improving the Reliability of Safetycritical Robots against Soft Errors
Nowadays, Robots account for most part of our lives in such a way that it is impossible for usto do many of affairs without them. Increasingly, the application of robots is developing fastand their functions become more sensitive and complex. One of the important requirements ofRobot use is a reliable software operation. For enhancement of reliability, it is a necessity todesign the fault toler...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملBatch Roundness Characterization and Evaluation
A new concept referred to as the batch roundness is presented in this paper. This concept is derived to illustrate the worst possible form error for a batch of circular features machined under the same conditions. It is to be used as a statistical quality measure for such a batch of circular features and evaluated by analyzing their systematic and random form error components. The definition of...
متن کاملImproving Fast Charging Methods Using Genetic Algorithm and Coordination between Chargers in Fast Charging Station of Electric Vehicles in Order to Optimal Utilization of Power Capacity of Station
Fast charging stations are one of the most important section in smart grids with high penetration of electric vehicles. One of the important issues in fast chargers is choosing the proper method for charging. In this paper, by defining an optimization problem with the objective of reducing the charging time, the optimal charging levels are obtained using a multi-stage current method using a gen...
متن کامل